ALGORITHMS FOR QUADRATIC FRACTIONAL PROGRAMMING PROBLEMS
نویسندگان
چکیده
منابع مشابه
Algorithms for Quadratic Fractional Programming Problems
Consider the nonlinear fractional programming problem max{f(x)lg(x)lxES}, where g(x»O for all XES. Jagannathan and Dinkelbach have shown that the maximum of this problem is equal to ~O if and only if max{f(x)-~g(x) IXES} is 0 for ~=~O. 1 t t Based on this result, we treat here a special case: f(x)=Zx Cx+r x+s, g(X)=~ xtDX+ptX+q and S is a polyhedron, where C is negative definite and D is positi...
متن کاملAn iterative method for tri-level quadratic fractional programming problems using fuzzy goal programming approach
Tri-level optimization problems are optimization problems with three nested hierarchical structures, where in most cases conflicting objectives are set at each level of hierarchy. Such problems are common in management, engineering designs and in decision making situations in general, and are known to be strongly NP-hard. Existing solution methods lack universality in solving these types of pro...
متن کاملA NEW APPROACH FOR SOLVING FULLY FUZZY QUADRATIC PROGRAMMING PROBLEMS
Quadratic programming (QP) is an optimization problem wherein one minimizes (or maximizes) a quadratic function of a finite number of decision variable subject to a finite number of linear inequality and/ or equality constraints. In this paper, a quadratic programming problem (FFQP) is considered in which all cost coefficients, constraints coefficients, and right hand side are characterized by ...
متن کاملQuadratic bi-level programming problems: a fuzzy goal programming approach
This paper presents a fuzzy goal programming (FGP) methodology for solving bi-level quadratic programming (BLQP) problems. In the FGP model formulation, firstly the objectives are transformed into fuzzy goals (membership functions) by means of assigning an aspiration level to each of them, and suitable membership function is defined for each objectives, and also the membership functions for vec...
متن کاملLinear Time Algorithms for Some Separable Quadratic Programming Problems
A large class of separable quadratic programming problems is presented The problems in the class can be solved in linear time The class in cludes the separable convex quadratic transportation problem with a xed number of sources and separable convex quadratic programming with nonnegativity con straints and a xed number of linear equality constraints
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1976
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.19.174